0 Some remarks on A ( 1 ) 1 soliton cellular automata
نویسنده
چکیده
We describe the A (1) 1 soliton cellular automata as an evolution of a poset. This allows us to explain the conservation laws for the A (1) 1 soliton cellular automata, one given by Torii, Takahashi and Satsuma, and the other given by Fukuda, Okado and Yamada, in terms of the stack permutations of states in a very natural manner. As a biproduct, we can prove a conjectured formula relating these laws.
منابع مشابه
Some Remarks on A ( 1 ) 1 Soliton Cellular Automata
We describe the A (1) 1 soliton cellular automata as an evolution of a poset. This allows us to explain the conservation laws for the A (1) 1 soliton cellular automata, one given by Torii, Takahashi and Satsuma, and the other given by Fukuda, Okado and Yamada, in terms of the stack permutations of states in a very natural manner. As a biproduct, we can prove a conjectured formula relating these...
متن کاملFrom soliton equations to integrable cellular automata through a limiting procedure.
In order to investigate complex physical phenomenon, we have to adopt a simple model which exhibits essential features of the phenomenon. Cellular automata (CA’s) serve as such simple models and have been widely investigated in physics, chemistry, biology, and computer sciences [1]. They present a large variety of structures in their evolution. About a decade ago, Park, Steiglitz, and Thurston ...
متن کاملFrom Soliton Equations to Integrable Celluar Automata through a Limiting Procedure
We show a direct connection between a cellular automaton and integrable nonlinear wave equations. We also present the N-soliton formula for the celluar automaton. Finally we propose a general method for constructing such integrable celluar automata and their N-soliton solutions. 03.40.Kf, 02.10.Jf, 52.35.Sb Typeset using REVTEX 1 In order to investigate a complex physical phenomenon, we have to...
متن کامل01 04 3 v 1 1 3 Ja n 20 00 Quantization of Soliton Cellular Automata ∗
A method of quantization of classical soliton cellular automata (QSCA) is put forward that provides a description of their time evolution operator by means of quantum circuits that involve quantum gates from which the associated Hamiltonian describing a quantum chain model is constructed. The intrinsic parallelism of QSCA, a phenomenon first known from quantum computers, is also emphasized. Int...
متن کاملAsynchronous Behavior of Double-Quiescent Elementary Cellular Automata
In this paper we propose a probabilistic analysis of the asynchronous behavior of elementary finite cellular automata (i.e. {0, 1} states, radius 1 and unidimensional) for which both states are quiescent (i.e. (0, 0, 0) 7→ 0 and (1, 1, 1) 7→ 1). It has been experimentally shown in previous works that introducing asynchronism in the global function of a cellular automata was perturbing its behav...
متن کامل